Helping him see guiding a visually impaired student through the computer science curriculum.

Evaluation of machine learning%2Dbased information extraction algorithms criticisms and recommendations.

Evaluating machine learning for information extraction.
Comparative evaluation of Machine Learning (ML) systems used for Information Extraction (IE) has suffered from various inconsistencies in experimental procedures. This paper reports on the results of the Pascal Challenge on Evaluating Machine Learning for Information Extraction, which provides a standardised corpus, set of tasks, and evaluation methodology. The challenge is described and the systems submitted by the ten participants are briefly introduced and their performance is analysed.
Effective incorporation of ethics into courses that focus on programming.

Efficient and Effective Induction of First Order Decision Lists.

Bottom%2DUp Relational Learning of Pattern Matching Rules for Information Extraction.
Information extraction is a form of shallow text processing that locates a specified set of relevant  items in a natural-language document. Systems for this task require significant domain-specific  knowledge and are time-consuming and difficult to build by hand, making them a good application  for machine learning. We present an algorithm, RAPIER, that uses pairs of sample documents  and filled templates to induce pattern-match rules that directly extract fillers for the slots in the  template. RAPIER is a bottom-up learning algorithm that incorporates techniques from several  inductive logic programming systems. We have implemented the algorithm in a system that allows  patterns to have constraints on the words, part-of-speech tags, and semantic classes present in the  filler and the surrounding text. We present encouraging experimental results on two domains.
Efficient and Effective Induction of First Order Decision Lists.

Testing skills and knowledge introducing a laboratory exam in CS1.

Testing skills and knowledge introducing a laboratory exam in CS1.

Reports on the AAAI 1999 Workshop Program.

Relational Learning of Pattern%2DMatch Rules for Information Extraction.
Information extraction is a form of shallow text processing that locates a specified set of relevant  items in a natural-language document. Systems for this task require significant domain-specific  knowledge and are time-consuming and difficult to build by hand, making them a good application  for machine learning. We present an algorithm, RAPIER, that uses pairs of sample documents  and filled templates to induce pattern-match rules that directly extract fillers for the slots in the  template. RAPIER is a bottom-up learning algorithm that incorporates techniques from several  inductive logic programming systems. We have implemented the algorithm in a system that allows  patterns to have constraints on the words, part-of-speech tags, and semantic classes present in the  filler and the surrounding text. We present encouraging experimental results on two domains.
Active Learning for Natural Language Parsing and Information Extraction.
In natural language acquisition, it is difficult to gather the annotated data needed for supervised learning; however, unannotated data is fairly plentiful. Active learning methods attempt to select for annotation and training only the most informative examples, and therefore are potentially very useful in natural language applications. However, existing results for active learning have only considered standard classification tasks. To reduce annotation effort while maintaining accuracy, we apply active learning to two non-classification tasks in natural language processing: semantic parsing and information extraction. We show that active learning can significantly reduce the number of annotated examples required to achieve a given level of performance for these complex tasks. Keywords: active learning, natural language learning, learning for parsing, learning for information extraction Email address of contact author: cthomp@csli.stanford.edu Phone number of contact author: (650)8...
Improving Learning by Choosing Examples Intelligently in Two Natural Language Tasks.


Advantages of Decision Lists and Implicit Negatives in Inductive Logic Programming.
This paper demonstrates the capabilities of Foidl, an inductive logic programming  (ILP) system whose distinguishing characteristics are the ability to produce first-order  decision lists, the use of an output completeness assumption as a substitute for negative  examples, and the use of intensional background knowledge. The development of Foidl  was originally motivated by the problem of learning to generate the past tense of English  verbs; however, this paper demonstrates its superior performance on two different sets  of benchmark ILP problems. Tests on the finite element mesh design problem show that  Foidl&#039;s decision lists enable it to produce generally more accurate results than a range  of methods previously applied to this problem. Tests with a selection of list-processing  problems from Bratko&#039;s introductory Prolog text demonstrate that the combination of  implicit negatives and intensionality allow Foidl to learn correct programs from far  fewer examples than Foil.

Induction of First%2DOrder Decision Lists Results on Learning the Past Tense of English Verbs
This paper presents a method for inducing logic programs from examples that learns a new class of concepts called first-order decision lists, defined as ordered lists of clauses each ending in a cut. The method, called Foidl, is based on Foil (Quinlan, 1990) but employs intensional background knowledge and avoids the need for explicit negative examples. It is particularly useful for problems that involve rules with specific exceptions, such as learning the past-tense of English verbs, a task widely studied in the context of the symbolic/connectionist debate. Foidl is able to learn concise, accurate programs for this problem from significantly fewer examples than previous methods (both connectionist and symbolic). 1. Introduction  Inductive logic programming (ILP) is a growing subtopic of machine learning that studies the induction of Prolog programs from examples in the presence of background knowledge (Muggleton, 1992; Lavrac &amp; Dzeroski, 1994). Due to the expressiveness of first-order...
Induction of First%2DOrder Decision Lists Results on Learning the Past Tense of English Verbs.
This paper presents a method for inducing logic programs from examples that learns a new class of concepts called first-order decision lists, defined as ordered lists of clauses each ending in a cut. The method, called Foidl, is based on Foil (Quinlan, 1990) but employs intensional background knowledge and avoids the need for explicit negative examples. It is particularly useful for problems that involve rules with specific exceptions, such as learning the past-tense of English verbs, a task widely studied in the context of the symbolic/connectionist debate. Foidl is able to learn concise, accurate programs for this problem from significantly fewer examples than previous methods (both connectionist and symbolic). 1. Introduction  Inductive logic programming (ILP) is a growing subtopic of machine learning that studies the induction of Prolog programs from examples in the presence of background knowledge (Muggleton, 1992; Lavrac &amp; Dzeroski, 1994). Due to the expressiveness of first-order...
